Local Graph Clustering Beyond Cheeger's Inequality

Motivated by applications of large-scale graph clustering, we study random-walk-based local algorithms whose running times depend only on the size of the output cluster, rather than the entire graph. All previously known such algorithms guarantee an output conductance of Õ( √ φ(A)) when the target set A has conductance φ(A) ∈ [0, 1]. In this paper, we improve it to Õ ( min {√ φ(A), φ(A) √ Conn(A) }) , where the internal connectivity parameter Conn(A) ∈ [0, 1] is defined as the reciprocal of the mixing time of the random walk over the induced subgraph on A. For instance, using Conn(A) = Ω(λ(A)/ log n) where λ is the second eigenvalue of the Laplacian of the induced subgraph onA, our conductance guarantee can be as good as Õ(φ(A)/ √ λ(A)). This builds an interesting connection to the recent advance of the so-called improved Cheeger’s Inequality [KLL13], which says that global spectral algorithms can provide a conductance guarantee of O(φopt/ √ λ3) instead of O( √ φopt). In addition, we provide theoretical guarantee on the clustering accuracy (in terms of precision and recall) of the output set. We also prove that our analysis is tight, and perform empirical evaluation to support our theory on both synthetic and real data. It is worth noting that, our analysis outperforms prior work when the cluster is wellconnected. In fact, the better it is well-connected inside, the more significant improvement (both in terms of conductance and accuracy) we can obtain. Our results shed light on why in practice some random-walk-based algorithms perform better than its previous theory, and help guide future research about local clustering.